Behavioral Partitioning with Synthesis for Multi-FPGA Architectures under Interconnect, Area, and Latency Constraints
نویسندگان
چکیده
This paper presents a technique to perform partitioning and synthesis of behavioral specifications. Partitioning of the design is done under multiple constraints – interconnections and device areas of the reconfigurable architecture, and the latency of the design. The proposed Multi-FPGA partitioning technique (FMPAR) is based on the Fiduccia-Mattheyses (FM) partitioning algorithm. In order to contemplate multiple implementations of the behavioral design, the partitioner is tightly integrated with an area estimator and design space exploration engine. A partitioning and synthesis framework was developed, with the FMPAR behavioral partitioner at the front-end and various synthesis phases (High-Level, Logic and Layout) at the back end. Results are provided to demonstrate the advantage of tightly integrating exploration with partitioning. It is also shown that, in relatively short runtimes, FMPAR generates designs of similar quality compared to a Simulated Annealing partitioner. Designs have been successfully implemented on a commercial multi-FPGA board, proving the effectiveness of the partitioner and the entire design framework.
منابع مشابه
Interconnect Synthesis for Reconfigurable Multi-FPGA Architectures
Most reconngurable multi-fpga architectures have a pro-grammable interconnection network that can be reconngured to implement diierent interconnection patterns between the fpgas and memory devices on the board. Partitioning tools for such architectures must produce the necessary pin-assignments and interconnect connguration stream that correctly implement the partitioned design. We call this pr...
متن کاملPartitioning of Functional Models of Synchronous Digital Systems
We present a partitioning technique of functional models that is used in conjunction with high-level synthesis of digital synchronous circuits. The partitioning goal is to synthesize multi-chip systems from one behavioral description, that satisfy both chip area constraints and an overall latency timing constraint. There are three major advantages of using partitioning techniques at the functio...
متن کاملAn Integrated Task Graph Partitioning and RTL Design Space Exploration System for Multi-FPGA Architectures
This paper presents spade, an integrated partitioning and register transfer level (rtl) design space exploration system for multi-fpga reconngurable architectures. The input to spade is an acyclic task graph, T G = (T; E), where T is the set of tasks and E is the set of edges. Tasks represent behavioral or algorith-mic code segments. Edges denote data dependencies between tasks. Each task is pr...
متن کاملSynthesis of Multi–Mode Memory Interfaces for FPGA Reconfigurable Computing Machine
Multi-core reconfigurable architectures where soft-cores can be programmed over a reconfigurable substrate such as in an FPGA are a reality. For these target architectures it will become imperative that high-level mapping tools can synthesize and estimate the impact of high-level transformations in the overall design in terms of speed and area. The lack of support for external memory operations...
متن کاملInterconnection Architecture model of the Architecture Configuration Stream Configurable Inputs
Most reconngurable multi-fpga architectures have a programmable interconnection network that can be reconngured to implement diierent interconnection patterns between the fpgas and memory devices on the board. Partitioning tools for such architectures must produce the necessary pin-assignments and interconnect connguration stream that correctly implement the partitioned design. We call this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000